TSTP Solution File: SEV053^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV053^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:12 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 136 ( 40 equ; 0 cnn)
% Maximal formula atoms : 5 ( 8 avg)
% Number of connectives : 258 ( 28 ~; 14 |; 16 &; 191 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 42 !; 4 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
cF: b > b ).
thf(func_def_3,type,
cA: b > a ).
thf(func_def_4,type,
cL: a > a > $o ).
thf(func_def_8,type,
sK0: b ).
thf(f20,plain,
$false,
inference(subsumption_resolution,[],[f19,f13]) ).
thf(f13,plain,
! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( cL @ X2 @ X1 )
= $true )
| ( ( cL @ X2 @ X3 )
!= $true )
| ( $true
!= ( cL @ X3 @ X1 ) ) )
& ( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true )
=> ( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( cL @ X2 @ X1 )
= $true )
| ( ( cL @ X2 @ X3 )
!= $true )
| ( $true
!= ( cL @ X3 @ X1 ) ) )
& ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) )
& ! [X3: a,X2: a,X1: a] :
( ( ( cL @ X2 @ X3 )
= $true )
| ( ( cL @ X2 @ X1 )
!= $true )
| ( ( cL @ X1 @ X3 )
!= $true ) )
& ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true )
& ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) )
& ! [X3: a,X1: a,X2: a] :
( ( ( cL @ X2 @ X3 )
= $true )
| ( ( cL @ X1 @ X3 )
!= $true )
| ( ( cL @ X2 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) )
& ! [X3: a,X1: a,X2: a] :
( ( ( ( cL @ X1 @ X3 )
= $true )
& ( ( cL @ X2 @ X1 )
= $true ) )
=> ( ( cL @ X2 @ X3 )
= $true ) ) )
=> ! [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: b] : ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( cL @ X2 @ X1 )
& ( cL @ X1 @ X3 ) )
=> ( cL @ X2 @ X3 ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
& ! [X1: a,X0: a,X2: a] :
( ( ( cL @ X0 @ X1 )
& ( cL @ X1 @ X2 ) )
=> ( cL @ X0 @ X2 ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
& ! [X1: a,X0: a,X2: a] :
( ( ( cL @ X0 @ X1 )
& ( cL @ X1 @ X2 ) )
=> ( cL @ X0 @ X2 ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YutvcWf6AO/Vampire---4.8_814',cTHM89B_pme) ).
thf(f19,plain,
( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f16,plain,
( ( $true != $true )
| ( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) ) ) ),
inference(superposition,[],[f15,f13]) ).
thf(f15,plain,
! [X0: a] :
( ( ( cL @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true )
| ( ( cL @ ( cA @ sK0 ) @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f14,plain,
! [X0: a] :
( ( ( cL @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true )
| ( $true != $true )
| ( ( cL @ ( cA @ sK0 ) @ X0 )
!= $true ) ),
inference(superposition,[],[f11,f12]) ).
thf(f12,plain,
! [X2: a,X3: a,X1: a] :
( ( ( cL @ X2 @ X1 )
= $true )
| ( $true
!= ( cL @ X3 @ X1 ) )
| ( ( cL @ X2 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f11,plain,
( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV053^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 12:39:32 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.YutvcWf6AO/Vampire---4.8_814
% 0.14/0.38 % (930)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (932)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.14/0.38 % (931)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.14/0.38 % (933)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.14/0.38 % (926)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.14/0.38 % (928)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.14/0.38 % (930)Instruction limit reached!
% 0.14/0.38 % (930)------------------------------
% 0.14/0.38 % (930)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (930)Termination reason: Unknown
% 0.14/0.38 % (930)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (930)Memory used [KB]: 895
% 0.14/0.38 % (930)Time elapsed: 0.003 s
% 0.14/0.38 % (930)Instructions burned: 2 (million)
% 0.14/0.38 % (930)------------------------------
% 0.14/0.38 % (930)------------------------------
% 0.14/0.38 % (929)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (927)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.14/0.38 % (931)First to succeed.
% 0.14/0.38 % (933)Instruction limit reached!
% 0.14/0.38 % (933)------------------------------
% 0.14/0.38 % (933)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (933)Termination reason: Unknown
% 0.14/0.38 % (933)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (929)Instruction limit reached!
% 0.14/0.38 % (929)------------------------------
% 0.14/0.38 % (929)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (933)Memory used [KB]: 5500
% 0.14/0.38 % (933)Time elapsed: 0.004 s
% 0.14/0.38 % (933)Instructions burned: 3 (million)
% 0.14/0.38 % (933)------------------------------
% 0.14/0.38 % (933)------------------------------
% 0.14/0.38 % (929)Termination reason: Unknown
% 0.14/0.38 % (929)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (929)Memory used [KB]: 5373
% 0.14/0.38 % (929)Time elapsed: 0.003 s
% 0.14/0.38 % (929)Instructions burned: 2 (million)
% 0.14/0.38 % (929)------------------------------
% 0.14/0.38 % (929)------------------------------
% 0.14/0.38 % (932)Also succeeded, but the first one will report.
% 0.14/0.38 % (931)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for Vampire---4
% 0.14/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.38 % (931)------------------------------
% 0.14/0.38 % (931)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (931)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (931)Memory used [KB]: 5500
% 0.14/0.38 % (931)Time elapsed: 0.003 s
% 0.14/0.38 % (931)Instructions burned: 3 (million)
% 0.14/0.38 % (931)------------------------------
% 0.14/0.38 % (931)------------------------------
% 0.14/0.38 % (925)Success in time 0.004 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------